Model Checking PA-Processes
نویسنده
چکیده
PA (Process algebra) is the name that has become common use to denote the algebra with a sequential and parallel operator (without communication), plus recursion. PA-processes subsume both Basic Parallel Processes (BPP) Chr93] and context-free processes (BPA). They are a simple model for innnite state concurrent systems. We show that the model checking problem for the branching time temporal logic EF is decidable for PA-processes.
منابع مشابه
The Regular Viewpoint on Pa−processes the Regular Viewpoint on Pa-processes
PA is the process algebra allowing non-determinism, sequential and parallel compositions, and recursion. We suggest a view of PA-processes as tree languages. Our main result is that the set of iterated predecessors of a regular set of PA-processes is a regular tree language, and similarly for iterated successors. Furthermore, the corresponding tree-automata can be built eeectively in polynomial...
متن کاملDecidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizability by tree automata of the reachability relation. The tree automata approach and the transition logics we use allow a smooth and general treatment of parameterized model checking for PA. This approach is extended to h...
متن کاملDecidability of model checking with the temporal logic EF
The branching-time temporal logic EF is a simple, but natural fragment of computation tree logic (CTL) and the modal-calculus. We study the decidability of the model checking problem for EF and innnite-state systems. We use process rewrite systems (PRS) to describe innnite-state systems and deene a hierarchy of subclasses of PRS that includes Petri nets, pushdown processes, Basic Parallel Proce...
متن کاملThe Regular Viewpoint on PA-Processes
PA is the process algebra allowing non-determinism, sequential and parallel compositions, and recursion. We suggest a view of PAprocesses as tree languages. Our main result is that the set of (iterated) predecessors of a regular set of PA-processes is a regular tree language, and similarly for (iterated) successors. Furthermore, the corresponding tree-automata can be built e ectively in polynom...
متن کاملDL-PA and DCL-PC: model checking and satisfiability problem are indeed in PSPACE
We prove that the model checking and the satisfiability problem of both Dynamic Logic of Propositional Assignments DL-PA and Coalition Logic of Propositional Control and Delegation DCL-PC are in PSPACE. We explain why the proof of EXPTIME-hardness of the model checking problem of DL-PA presented in [1, Thm 4] is false. We also explain why the proof of membership in PSPACE of the model checking ...
متن کامل